On the selectivity of multidimensional routing indices.

X%2DSDR An Extensible Experimentation Suite for Dimensionality Reduction.

Distributed Knowledge Discovery with Non Linear Dimensionality Reduction.

Advertising network formation based on stochastic diffusion search and market equilibria.

Quality Assessment Approaches in Data Mining.

A Review of Web Document Clustering Approaches.

Ranking the sky Discovering the importance of skyline points through subspace dominance relationships.

Efficient Routing of Subspace Skyline Queries over Highly Distributed Data.

Text Relatedness Based on a Word Thesaurus.

Multidimensional routing indices for efficient distributed query processing.

Efficient search based on content similarity over self%2Dorganizing P2P networks.

Multidimensional routing indices for efficient distributed query processing.

Omiotis A Thesaurus%2DBased Measure of Text Relatedness.

FEDRA A Fast and Efficient Dimensionality Reduction Algorithm.

Web Page Rank Prediction with PCA and EM Clustering.

Semantic relatedness hits bibliographic data.


Clustering Validity.
Cluster analysis aims at identifying groups of similar objects and, therefore helps to discover distribution of patterns and interesting correlations in large data sets. It has been subject of wide research since it arises in many application domains in engineering, business and social sciences. Especially, in the last years the availability of huge transactional and experimental data sets and the arising requirements for data mining created needs for clustering algorithms that scale and can be applied in diverse domains.

Skyline%2Dbased Peer%2Dto%2DPeer Top%2Dk Query Processing.
Lately the advances in centralized database management systems show a trend towards supporting rank-aware query operators, like top-k, that enable users to retrieve only the most interesting data objects. A challenging problem is to support rank-aware queries in highly distributed environments. In this paper, we present a novel approach, called SPEERTO, for top-k query processing in large-scale peer-topeer networks, where the dataset is horizontally distributed over the peers. Towards this goal, we explore the applicability of the skyline operator for efficiently routing top-k queries in a large super-peer network. Relying on a thresholding scheme, SPEERTO returns the exact results progressively to the user, while the number of queried super-peers and transferred data is minimized. Finally, we propose different variations of SPEERTO that allow balancing between transferred data volume and response time. Through simulations we demonstrate the feasibility of our approach.
Peer%2Dto%2Dpeer similarity search over widely distributed document collections.
This paper addresses the challenging problem of similarity search over widely distributed ultra-high dimensional data. Such an application is retrieval of the top-k most similar documents in a widely distributed document collection, as in the case of digital libraries. Peer-to-peer (P2P) systems emerge as a promising solution to delve with content management in cases of highly distributed data collections. We propose a self-organizing P2P approach in which an unstructured P2P network evolves into a super-peer architecture, with super-peers responsible for peers with similar content. Our approach is based on distributed clustering of peer contents, thus managing to create high quality clusters that span the entire network. More importantly, we show how to efficiently process similarity queries capitalizing on the newly constructed, clustered super-peer network. During query processing, the query is propagated only to few carefully selected super-peers that are able to return results of high quality. We evaluate the performance of our approach and demonstrate its advantages through simulation experiments on two document collections.
Schema%2Dassisted peer selection for XML querying in unstructured P2P systems.
XML is emerging as the de-facto standard for semistructured contents and metadata. Searching this content in mobile environments is challenging, since centralized approaches are not appropriate in a very dynamic environment with limited resources available for keeping a centralized index up-to-date. A more appropriate solution is to organize the mobile devices in an unstructured peerto-peer (P2P) network. The main challenge in the context of unstructured P2P is to determine the peers that might store documents matching a query, i.e., peer selection. In this paper, we propose a summary caching method for increasing the efficiency and recall of peer selection during XML querying. Our approach is based on caching parts of XML schemas along the query path, to enable subsequent jumps to remote peers storing content relevant to the query. We evaluate the performance improvements of our search strategy in terms of completeness of the search and reduced latency. The results show that our approach can significantly enhance a naive query mechanism such as flooding, and consistently outperform a baseline path caching technique similar to techniques used in related work.
On efficient top%2Dk query processing in highly distributed environments.
Lately the advances in centralized database management systems show a trend towards supporting rank-aware query operators, like top-k, that enable users to retrieve only the most interesting data objects. A challenging problem is to support rank-aware queries in highly distributed environments. In this paper, we present a novel approach, called SPEERTO, for top-k query processing in large-scale peer-topeer networks, where the dataset is horizontally distributed over the peers. Towards this goal, we explore the applicability of the skyline operator for efficiently routing top-k queries in a large super-peer network. Relying on a thresholding scheme, SPEERTO returns the exact results progressively to the user, while the number of queried super-peers and transferred data is minimized. Finally, we propose different variations of SPEERTO that allow balancing between transferred data volume and response time. Through simulations we demonstrate the feasibility of our approach.
Word Sense Disambiguation with Semantic Networks.

Web page rank prediction with markov models.
In this paper we propose a method for predicting the ranking position of a Web page. Assuming a set of successive past top-k rankings, we study the evolution of Web pages in terms of ranking trend sequences used for Markov Models training, which are in turn used to predict future rankings. The predictions are highly accurate for all experimental setups and similarity measures. Categories and Subject Descriptors
NPClu An approach for clustering spatially extended objects.

A density%2Dbased cluster validity approach using multi%2Drepresentatives.

CASD Management of a context%2Daware service directory.

CASD Management of a context%2Daware service directory.

A clustering framework based on subjective and objective validity criteria.

Designing a Peer%2Dto%2DPeer Architecture for Distributed Image Retrieval.

A Large Scale Data Mining Approach to Antibiotic Resistance Surveillance.

Stability Based Sparse LSI%2FPCA Incorporating Feature Selection in LSI and PCA.

SKYPEER Efficient Subspace Skyline Computation over Distributed Data.
Skyline query processing has received considerable attention in the recent past. Mainly, the skyline query is used to find a set of non dominated data points in a multidimensional dataset. While most previous work has assumed a centralized setting, in this paper we address the efficient computation of subspace skyline queries in largescale peer-to-peer (P2P) networks, where the dataset is horizontally distributed across the peers. Relying on a superpeer architecture we propose a threshold based algorithm, called SKYPEER, which forwards the skyline query requests among peers, in such a way that the amount of transferred data is significantly reduced. For efficient subspace skyline processing, we extend the notion of domination by defining the extended skyline set, which contains all data elements that are necessary to answer a skyline query in any arbitrary subspace. We prove that our algorithm provides the exact answers and we present optimization techniques to reduce communication cost and execution time. Finally, we provide an extensive experimental evaluation showing that SKYPEER performs efficiently and provides a viable solution when a large degree of distribution is required. 1.
Word Sense Disambiguation with Spreading Activation Networks Generated from Thesauri.
Most word sense disambiguation (WSD) methods require large quantities of manually annotated training data and/or do not exploit fully the semantic relations of thesauri. We propose a new unsupervised WSD algorithm, which is based on generating Spreading Activation Networks (SANs) from the senses of a thesaurus and the relations between them. A new method of assigning weights to the networks ’ links is also proposed. Experiments show that the algorithm outperforms previous unsupervised approaches to WSD. 1
Peer%2Dto%2DPeer Similarity Search in Metric Spaces.
This paper addresses the efficient processing of similarity queries in metric spaces, where data is horizontally distributed across a P2P network. The proposed approach does not rely on arbitrary data movement, hence each peer joining the network autonomously stores its own data. We present SIMPEER, a novel framework that dynamically clusters peer data, in order to build distributed routing information at super-peer level. SIMPEER allows the evaluation of range and nearest neighbor queries in a distributed manner that reduces communication cost, network latency, bandwidth consumption and computational overhead at each individual peer. SIMPEER utilizes a set of distributed statistics and guarantees that all similar objects to the query are retrieved, without necessarily flooding the network during query processing. The statistics are employed for estimating an adequate query radius for k-nearest neighbor queries, and transform the query to a range query. Our experimental evaluation employs both real-world and synthetic data collections, and our results show that SIMPEER performs efficiently, even in the case of high degree of distribution.  
Comparing apples and oranges normalized pagerank for evolving graphs.

Web site personalization based on link analysis and navigational patterns.

Context%2Dbased caching and routing for P2P web service discovery.


DESENT decentralized and distributed semantic overlay generation in P2P networks.
  The current approach in web searching, i.e., centralized search engines, rises issues that question their future applicability: 1) coverage and scalability, 2) freshness, and 3) information monopoly. Performing web search using a P2P architecture that consists of the actual web servers has the potential to tackle those issues above. In order to achieve the desired performance and scalability, as well as enhancing search quality relative to centralized search engines, semantic overlay networks (SONs) connecting peers storing semantically related information can be employed. The lack of global content/topology knowledge in a P2P system is the key challenge in forming SONs, and this paper describes an unsupervised approach for decentralized and distributed generation of SONs (DESENT). Through simulations and analytical cost modeling we verify our claims regarding performance, scalability, and quality. 

Scalable Semantic Overlay Generation for P2P%2DBased Digital Libraries.

K%2DLandmarks Distributed Dimensionality Reduction for Clustering Quality Maintenance.

Peer%2Dto%2DPeer Clustering for Semantic Overlay Network Generation.

Schema Caching for Improved XML Query Processing in P2P Systems.

Representing and Quantifying Rank %2D Change for the Web Graph.
Abstract. The web graph is an immensely dynamic structure continuously changing with regards to pages and links. One of the grand challenges in the last years is efficient web search inherently involving the issue of page ranking. In this paper we address the issue of representing and quantifying the web graph evolution. We study the rank position of a web page among different snapshots of the web graph and propose similarity measures of the rank change rate that are independent of the graph size. We define the rank change rate (racer) quantifying the web graph evolution. Thereafter, we examine different ways to aggregate the rank change rates and to identify highly dynamic web pages. In our experimental evaluation we study the dynamic of the web pages especially for pages that have a high rank position.
The SOWES approach to P2P web search using semantic overlays.
Peer-to-peer (P2P) Web search has gained a lot of interest lately, due to the salient characteristics of P2P systems, namely scalability, fault-tolerance and load-balancing. However, the lack of global knowledge in a vast and dynamically evolving environment like the Web presents a grand challenge for organizing content and providing efficient searching. Semantic overlay networks (SONs) have been proposed as an approach to reduce cost and increase quality of results, and in this paper we present an unsupervised approach for distributed and decentralized SON construction, aiming to support efficient search mechanisms in unstructured P2P systems. Categories and Subject Descriptors H.3.3 [Information storage and retrieval]: Information search
BuzzRank ... and the trend is your friend.
Ranking methods like PageRank assess the importance of Web pages based on the current state of the rapidly evolving Web graph. The dynamics of the resulting importance scores, however, have not been considered yet, although they provide the key to an understanding of the Zeitgeist on the Web. This paper proposes the BuzzRank method that quantifies trends in time series of importance scores and is based on a relevant growth model of importance scores. We experimentally demonstrate the usefulness of BuzzRank on a bibliographic dataset.
A System Architecture for Context%2DAware Service Discovery.
Recent technological advances have enabled both the consumption and provision of mobile services (m-services) by small, portable, handheld devices. However, mobile devices still have restricted capabilities with respect to processing, storage space, energy consumption, stable connectivity, bandwidth availability. In order to address these shortcomings, a potential solution is context-awareness (by context we refer to the implicit information related both to the requesting user and service provider that can a#ect the usefulness of the returned results). Context plays the role of a filtering mechanism, allowing only transmission of relevant data and services back to the device, thus saving bandwidth and reducing processing costs. In this paper, we present an architecture for context-aware service discovery. We describe in detail the system implementation and we present the system evaluation as a tradeo# between a) the increase of the quality of service discovery when context-awareness is taken into account and b) the extra cost/burden imposed by context management.
Introducing Semantics in Web Personalization The Role of Ontologies.

Usage%2DBased PageRank for Web Personalization.

A Framework for Semi%2DSupervised Learning Based on Subjective and Objective Clustering Criteria.

The role of caching and context%2Dawareness in P2P service discovery.
Mobile terminals (cellular phones, PDAs, palmtops etc.) emerge as a new class of small-scale, ad-hoc service providers that share data and functionality via mobile web services&#039; calls. In mobile service discovery, it is often the case that implicit contextual information such as the location of the requestor, time the query was submitted, capabilities of the involved devices have a significant impact on query evaluation and the quality of the results. On the other hand, lack of scalability and the well-known single point of failure problem call for distribution of service directories into several peers. In this paper, we present an approach for context-aware service discovery where service directories reside in a P2P architecture. We explore the role and benefits of context-awareness and caching query results in the service discovery process. We conduct extensive experiments coming up with guidelines for service directory design in a P2P context.
Word Sense Disambiguation for Exploiting Hierarchical Thesauri in Text Classification.

Web path recommendations based on page ranking and Markov models.
Markov models have been widely used for modelling users&#039; navigational behaviour in the Web graph, using the transitional probabilities between web pages, as recorded in the web logs. The recorded users &#039; navigation is used to extract popular web paths and predict current users ’ next steps. Such purely usage-based probabilistic models, however, present certain shortcomings. Since the prediction of users &#039; navigational behaviour is based solely on the usage data, structural properties of the Web graph are ignored. Thus important- in terms of pagerank authority score- paths may be underrated. In this paper we present a hybrid probabilistic predictive model extending the properties of Markov models by incorporating link analysis methods. More specifically, we propose the use of a PageRank-style algorithm for assigning prior probabilities to the web pages based on their importance in the web site&#039;s graph. We prove, through experimentation, that this approach results in more objective and representative predictions than the ones produced from the pure usage-based approaches.
Quality Assessment Approaches in Data Mining.

A Review of Web Document Clustering Approaches.

Time%2DAware Authority Ranking.
Abstract. The link structure of the web is analyzed to measure the authority of pages, which can be taken into account for ranking query results. Due to the enormous dynamics of the web, with millions of pages created, updated, deleted, and linked to every day, temporal aspects of web pages and links are crucial factors for their evaluation. Users are interested in important pages (i.e., pages with high authority score) but are equally interested in the recency of information. Time—and thus the freshness of web content and link structure—emanates as a factor that should be taken into account in link analysis when computing the importance of a page. So far only minor effort has been spent on the integration of temporal aspects into link-analysis techniques. In this paper we introduce T-Rank Light and T-Rank, two link-analysis approaches that take into account the temporal aspects freshness (i.e., timestamps of most recent updates) and activity (i.e., update rates) of pages and links. Experimental results show that T-Rank Light and T-Rank can produce better rankings of web pages. 1.
SEWeP A Web Mining System Supporting Semantic Personalization.
We present SEWeP, a Web Personalization prototype system that integrates  usage data with content semantics, expressed in taxonomy terms, in order to produce a  broader yet semantically focused set of recommendations.
T%2DRank Time%2DAware Authority Ranking.
Abstract. The link structure of the web is analyzed to measure the authority of pages, which can be taken into account for ranking query results. Due to the enormous dynamics of the web, with millions of pages created, updated, deleted, and linked to every day, temporal aspects of web pages and links are crucial factors for their evaluation. Users are interested in important pages (i.e., pages with high authority score) but are equally interested in the recency of information. Time—and thus the freshness of web content and link structure—emanates as a factor that should be taken into account in link analysis when computing the importance of a page. So far only minor effort has been spent on the integration of temporal aspects into link-analysis techniques. In this paper we introduce T-Rank Light and T-Rank, two link-analysis approaches that take into account the temporal aspects freshness (i.e., timestamps of most recent updates) and activity (i.e., update rates) of pages and links. Experimental results show that T-Rank Light and T-Rank can produce better rankings of web pages. 1.
Web personalization integrating content semantics and navigational patterns.

THESUS%2C a Closer View on Web Content Management Enhanced with Link Semantics.
“The greatest help we can give others is not to share our riches with them, but to discover theirs.” Louis Lavelle, L’Erreur de Narcisse, 1939 With the unstoppable growth of the WWW, the great success of Web Search Engines, such as Google and Alta-vista, users now turn to the Web whenever looking for information. However, many users are neophytes when it comes to computer science, yet they are often specialists of a certain domain. These users would like to add more semantics to guide their search through WWW material, whereas currently most search features are based on raw lexical content. We show in this article how the use of the incoming links of a page can be used efficiently to classify a page in a concise manner. This enhances the browsing and querying of web pages. In this article, we focus on the tools needed in order to manage the links, and their semantics. We further process these links using a hierarchy of concepts, akin to an ontology, and a thesaurus. This work is demonstrated by an prototype system, called THESUS, that organizes thematic web documents into semantic clusters. Our contributions in this article are the following: 1- a model and language to exploit link semantics information, 2- the THESUS prototype system, 3- its innovative aspects and algorithms, more specifically the novel similarity measure, between web documents applied to different clustering schemes (DB-Scan and COBWEB), 4- a thorough experimental evaluation proving the value of our approach.
Distributed Virtual Reality Authoring Interfaces for the WWW The VR%2DShop Case.

Uncertainty Handling and Quality Assessment in Data Mining

Towards a Logical Model for Patterns.

SEWeP using site semantics and a taxonomy to enhance the Web personalization process.
Web personalization is the process of customizing a Web site to the needs of each specific user or set of  users, taking advantage of the knowledge acquired through the analysis of the user&#039;s navigational  behavior. Integrating usage data with content, structure or user profile data enhances the results of the  personalization process. In this paper, we present SEWeP, a system that makes use of both the usage  logs and the semantics of a Web site&#039;s content in order to personalize it. Web content is semantically  annotated using a conceptual hierarchy (taxonomy). We introduce C-logs, an extended form of Web  usage logs that encapsulates knowledge derived from the link semantics. C-logs are used as input to the  Web usage mining process, resulting in a broader yet semantically focused set of recommendations.
Advanced Uses Composing Interactive Spatio%2Dtemporal Documents.

Towards a Context%2DAware Service Directory.
Advances in the areas of mobile computing and web services  lead to new scenarios of use and innovative applications. Our approach  involves mobile devices that act not only as requestors of data, but as  data providers as well, providing access to their data through web services.
MobiShare Sharing Context%2DDependent Data and Services from Mobile Sources.
Rapid advances in wireless and mobile communications and computing technologies have enabled handy personal mobile devices to be used in everyday life. Such small mobile devices can now become not only information browsers and service clients, but also information and service providers, complementing or replacing fixed hosts connected to the wireline network. Such mobile resources can be very important for other moving users and mobile devices, creating significant opportunities for many interesting and novel applications. The MobiShare architecture outlined in this paper provides a scalable infrastructure for ubiquitous mobile access to dynamic information and mechanisms for publishing, discovering and accessing heterogeneous mobile resources in a large area, taking into account the context of both providers and requestors. Any wireless communication technology could be employed between a device and the system. In addition, the use of XML-related languages and protocols for describing and exchanging metadata gives the system a uniform, easily adaptable and platform-independent interface, allowing a variety of devices to use it. The overall approach is data-centric and service-oriented, implying that all the devices are treated both as potential providers or requestors of data wrapped as information m-services. ♣ This research is partially supported by EU IST project DBGlobe (IST-2001-32645) under the FET Proactive Initiative on Global Computing for the co-operation of autonomous and mobile entities in dynamic environments. 1.
Web mining for web personalization.
Web personalization is the process of customizing a Web site to the needs of specific users, taking advantage of the knowledge acquired from the analysis of the user’s navigational behavior (usage data) in correlation with other information collected in the Web context, namely, structure, content and user profile data. Due to the explosive growth of the Web, the domain of Web personalization has gained great momentum both in the research and commercial areas. In this article we present a survey of the use of Web mining for Web personalization. More specifically, we introduce the modules that comprise a Web personalization system, emphasizing the Web usage mining module. A review of the most common methods that are used as well as technical issues that occur is given, along with a brief overview of the most popular tools and applications available from software vendors. Moreover, the most important research initiatives in the Web usage mining and personalization areas are presented.
DBGlobe a service%2Doriented P2P system for global computing.
The challenge of peer-to-peer computing goes beyond simple file sharing. In the DBGlobe project, we view the multitude of peers carrying data and services as a superdatabase. Our goal is to develop a data management system for modeling, indexing and querying data hosted by such massively distributed, autonomous and possibly mobile peers. We employ a service-oriented approach, in that data are encapsulated in services. Direct querying of data is also supported by an XML-based query language. In this paper, we present our research results along the following topics: (a) infrastructure support, including mobile peers and the creation of context-dependent communities, (b) metadata management for services and peers, including locationdependent data, (c) filters for efficiently routing path queries on hierarchical data, and (d) querying using the AXML language that incorporates service calls inside XML documents.
THESUS Organizing Web document collections based on link semantics.
The requirements for effective search and management of the WWW are stronger than ever. Currently web documents are classified based on their content not taking into account the fact that these documents are connected to each other by links. We claim that a page&#039;s classification is enriched by the detection of its incoming links&#039; semantics. This would enable effective browsing and enhance the validity of search results in the WWW context. Another aspect that is under addressed and is strictly related to the tasks of browsing and searching is the similarity of documents at the semantic level. The above observations lead us to the adoption of a hierarchy of concepts (ontology) and a thesaurus to exploit links and provide a better characterization of web documents. The enhancement of the documents characterization makes operations such as clustering and labeling become very interesting. To this end, we devised a system called THESUS. The system deals with an initial sets of web documents, extracts keywords from all pages&#039; incoming links and converts them to semantics by mapping them to a domain&#039;s ontology. Subsequently, a clustering algorithm is applied to discover groups of web documents. The effectiveness of the clustering process is based on the use of a novel similarity measure between documents characterized by sets of terms. Web documents are organized into thematic subsets based on their semantics. The subsets are then labeled, thus enabling easier management (browsing, searching, querying) of the Web. In this article, we detail the process of this system and give an experimental analysis of its restfits.
UMiner A Data Mining System Handling Uncertainty and Quality.

Managing Uncertainty and Quality in the Classification Process.
An important open issue in KDD research is the reveal and the handling of uncertainty. The popular classification approaches do not take into account this feature while they do not exploit properly the significant amount of informarion included in the results of classification process (i.e., classification scheme), though it will be useful in decision-making. In this paper we present a framework that maintains uncertainty throughout the classification process by maintaining the classification belief and moreover enables assignment of an item to mulriple classes with a different belief. Decision support tools are provided for decisions related to: i. relative importance of classes in a dam set (i.e., &#034;young vs. old customers&#034;), ii. relative importance of classes across data sets iii. the informarion content of different dam sets. Finally we provide a mechanism for evaluaring classification schemes and select the scheme that best fits the data under consideration.
Cluster Validity Methods Part I.
Clustering is an unsupervised process since there are no predefined classes and no examples that would indicate grouping properties in the data set. The majority of the clustering algorithms behave differently depending on the features of the data set and the initial assumptions for defining groups. Therefore, in most applications the resulting clustering scheme requires some sort of evaluation as regards its validity. Evaluating and assessing the results of a clustering algorithm is the main subject of cluster validity.
Clustering Validity Checking Methods Part II.
Clustering restfits validation is an important topic in the context of pattern recognition. We review approaches and systems in this context. In the first part of this paper we presented clustering validity checking approaches based on internal and external criteria. In the second, current part, we present a review of clustering validity approaches based on relative criteria. Also we discuss the restfits of an experimental study based on widely known validity indices. Finally the paper illustrates the issues that are under-addressed by the recent approaches and proposes the research directions in the field.
Bridging XML%2Dschema and relational databases a system for generating and manipulating relational databases using valid XML documents.
Many organizations and enterprises establish distributed working environments, where different users need to exchange information based on a common model. XML is widely used to facilitate this information exchange. The extensibility of XML allows the creation of generic models that integrate data from different sources. For these tasks, several applications are used to import and export information in XML format from the data repositories. In order to support this process for relational repositories we developed the X-Database system. The base of this system is an XML-Schema file that describes the logical model of interchanged information. Initially, the system analyses the syntax of the XML-Schema file and generates the relational database. Then it handles the decomposition of valid XML files according to that Schema and the composition of XML documents from the information in the database. Finally the system offers a flexible mechanism for modifying and querying database contents using only valid XML documents, which are validated over the XMLSchema file&#039;s rules.
Clustering Validity Assessment Finding the Optimal Partitioning of a Data Set.
Clustering is a mostly unsupervised procedure and the majority of the clustering algorithms depend on certain assumptions in order to define the subgroups present in a data set. As a consequence, in most applications the resulting clustering scheme requires some sort of evaluation as regards its validity.
STEDEL A Language For Interactive Spatiotemporal Compositions.

The role of streaming in Interactive Multimedia Documents dissemination.

Web Document Searching Using Enhanced Hyperlink Semantics Based on XML.
We present a system that aims at increasing the flexibility and accuracy of information retrieval tasks in the World Wide Web. The system offers extended searching capabilities by enriching information related to hyperlinks between documents. It offers to documents’ authors the ability to attach additional information to hyperlinks and also provides suggestions on the information to be attached, In an effort to increase the integrity of hyperlink information, a conversion module extracts, from the pages, metadata concerning the linked documents as well as the link itsew The hyperlink metadata is appended to the original document metadata and an XML document is created. Another module allows the end-users to query the XML-document base, taking advantage of the enhanced hyperlink information. We present the overview of the system and the solutions it provides in problems found to similar approaches. 1.
A Data Set Oriented Approach for Clustering Algorithm Selection.
In the last years the availability of huge transactional and experimental data sets and the  arising requirements for data mining created needs for clustering algorithms that scale and can be  applied in diverse domains. Thus, a variety of algorithms have been proposed which have  application in different fields and may result in different partitioning of a data set, depending on  the specific clustering criterion used. Moreover, since clustering is an unsupervised process, most  of the algorithms are based on assumptions in order to define a partitioning of a data set. It is then  obvious that in most applications the final clustering scheme requires some sort of evaluation.
Clustering Algorithms and Validity Measures.

A Spatiotemporal Model and Language for Moving Objects on Road Networks.
Abstract. Moving object databases are becoming more popular due to the increasing number of application domains that deal with moving entities and need to pose queries. So far implementations of such systems have been rather weak and certainly not at industrial strength level. In this paper we define a concise data model and a set of powerful query predicates for moving objects. Moreover, we propose an implementation design based on off-the-shelf industrial solutions enhancing thus the applicability and robustness of our approach.
On Clustering Validation Techniques.
Cluster analysis aims at identifying groups of similar objects and, therefore helps to discover distribution of patterns and interesting correlations in large data sets. It has been subject of wide research since it arises in many application domains in engineering, business and social sciences. Especially, in the last years the availability of huge transactional and experimental data sets and the arising requirements for data mining created needs for clustering algorithms that scale and can be applied in diverse domains.
Distributed Virtual Reality Authoring Interfaces for the WWW.
Introduction  Electronic commerce is emerging as an important domain of integration and enhancement of  various technologies and research efforts. A trend in e-commerce applications is to provide  potential customers/visitors with the ability to preview and &#034;test&#034; products before they buy them. Using a 3-dimensional virtual representation of products is a step forward towards a persuasive preview. It is also very important for users to be able to view products in their own environment. These issues pose several technical and integration challenges.  This work concerns the design and implementation of a system that allows the interactive design of a room, the definition of pieces of furniture and the placement of electrical and electronic appliances. The system works over the WWW offering web-users a tool for designing and visualizing their rooms. The users may define each object in the room, its size, position, and spatial relationships with the room or other objects. Certain i
Quality Scheme Assessment in the Clustering Process.


Uncertainty Handling in Spatial Relationships.

Structured Interactive Animation for Multimedia Documents.

A foundation for representing and querying moving objects.
Spatio-temporal databases deal with geometries changing over time. The goal of our work is to provide a DBMS data model and query language capable of handling such time-dependent geometries, including those changing continuously which describe moving objects. Two fundamental abstractions are moving point and moving region, describing objects for which only the time-dependent position, or position and extent, are of interest, respectively. We propose to represent such time-dependent geometries as attribute data types with suitable operations, that is, to provide an abstract data type extension to a DBMS data model and query language. This paper presents a design of such a system of abstract data types. It turns out that besides the main types of interest, moving point and moving region, a relatively large number of auxiliary data types is needed. For example, one needs a line type to represent the projection of a moving point into the plane, or a &#034;moving real&#034; to represent the time-dependent distance of two moving points. It then becomes crucial to achieve (i) orthogonality in the design of the type system, i.e., type constructors can be applied uniformly, (ii) genericity and consistency of operations, i.e., operations range over as many types as possible and behave consistently, and (iii) closure and consistency between structure and operations of non-temporal and related temporal types. Satisfying these goals leads to a simple and expressive system of abstract data types that may be integrated into a query language to yield apowerful language for querying spatio-temporal data, including moving objects. The paper formally defines the types and operations, offers detailed insight into the considerations that went into the design, and exempli es the use of the abstract data types using SQL. The paper o ers a precise and conceptually clean foundation for implementing a spatio-temporal DBMS extension.  

Interactive Multimedia Documents A Modeling%2C Authoring and Rendering Approach.

Checking the Temporal Integrity of Interactive Multimedia Documents.
. When authoring multimedia scenarios, and in particular scenarios with user interaction, where the sequence and time of occurrence of interactions is not predefined, it is difficult to guarantee the consistency of the resulting scenarios. As a consequence, the execution of the scenario may result in unexpected behavior or inconsistent use of media. The present paper proposes a methodology for checking the temporal integrity of Interactive Multimedia Document (IMD) scenarios at authoring time at various levels. The IMD flow is mainly defined by the events occurring during the IMD session. Integrity checking consists of a set of discrete steps, during which we transform the scenario into temporal constraint networks representing the constraints linking the different possible events in the scenario. Temporal constraint verification techniques are applied to verify the integrity of the scenario, deriving a minimal network, showing possible temporal relationships between events given a set...
Interactive Multimedia Documents Modeling

Spatiotemporal Specification %26 Verification of Multimedia Scenarios.
A Multimedia Application (MAP) consists of a set of media objects ordered in the spatial and temporal domains. In this paper we present an authoring &amp; verification methodology for MAP documents development. We capitalize on a solid theoretical model for spatiotemporal compositions. The tool may be used both for prototyping and verification of multimedia presentations or spatiotemporal compositions in general. Regarding the authoring phase, emphasis was put on the flexible definition of spatial and temporal relationships of the participating entities. The verification procedures are supported by multiple tools allowing designers to preview their applications, in various ways: spatial layouts of the application window, temporal layouts, indicating the temporal duration and relationships among the participating objects and animation of the application. 1.
Temporal Integrity Constraints in Interactive Multimedia Documents.
When authoring multimedia scenarios, and in particular scenarios with user interaction, where the sequence and time of occurrence of interactions is not predefined, it is difficult to guarantee the consistency of the resulting scenarios. As a consequence, the execution of the scenario may result in unexpected behavior or inconsistent use of media. The present paper proposes to use temporal constraint verification techniques in a methodology for checking the temporal integrity of Interactive Multimedia Document scenarios at authoring time at various levels.  1. Introduction  An Interactive Multimedia Document (IMD) involves a variety of individual multimedia objects presented according to the IMD scenario. During rendering time, the multimedia objects that participate in the IMD are transformed, either spatially or temporally, in order to be presented according to author&#039;s requirements.  At authoring time, the author focuses in separate issues of the presentation at different times and ...
Spatio%2DTemporal Data Types An Approach to Modeling and Querying Moving Objects in Databases.
Spatio-temporal databases deal with geometries changing over time. In general, geometries cannot only change in discrete steps, but continuously, and we are talking about moving objects. If only the position in space of an object is relevant, then moving point is a basic abstraction; if also the extent is of interest, then the moving region abstraction captures moving as well as growing or shrinking regions. We propose a new line of research where moving points and moving regions are viewed as three-dimensional (2D space + time) or higher-dimensional entities whose structure and behavior is captured by modeling them as abstract data types. Such types can be integrated as base (attribute) data types into relational, object-oriented, or other DBMS data models; they can be implemented as data blades, cartridges, etc. for extensible DBMSs. We expect these spatio-temporal data types to play a similarly fundamental role for spatio-temporal databases as spatial data types have played for sp...
Specifying and Authoring Multimedia Scenarios.

Incorporating fuzzy set methodologies in a DBMS repository for the application domain of GIS.

Abstract and Discrete Modeling of Spatio%2DTemporal Data Types.

A Client%2DServer Design for Interactive Multimedia Documents Based on Java.

i%2DMu.S.E. %2D Interactive Multimedia Scenario Editor.

A Classification and Relationship Extraction Scheme for Raltional Databases Based on Fuzzy Logic.

Interactive multimedia scenario modeling rendering.

Spatio%2DTemporal Composition and Indexing for Large Multimedia Applications.

Events in Interactive Multimedia Applications Modeling and Implementation Design.
A variety of approaches and standards to model multimedia  presentations have been proposed. The  `interactivity&#039; of these models is often lacking or  unsatisfactory. Interactions, however, form an essential  part of an Interactive Multimedia Application (IMAP)  and need to be reflected in the modeling and  presentation of multimedia scenarios. A complex  modeling of interaction elements must cover all possible  interactions between a user and a computer as well as  those interactions between entities within the computer.  In this paper, we introduce the notion of events as they  are a promising approach for modeling the various interaction  elements in IMAPs. We elaborate on an event  classification scheme and according to this, an objectoriented  model for the different types of events in IMAPs.  We also propose a rich composition scheme to allow for  the definition of complex interactions. We also present  the design of a multimedia DBMS client that manages  IMAPs and implements the...
Spatio%2DTemporal Indexing for Large Multimedia Applications.
Multimedia applications usually involve a large number of multimedia objects (texts, images, sounds etc.). Spatial and temporal relationships among these objects should be efficiently supported and retrieved within a multimedia authoring tool. In this paper we present several spatial, temporal and spatio-temporal relationships of interest and propose efficient indexing schemes, based on multidimensional (spatial) data structures, for large multimedia applications that involve thousands of objects. Evaluation models of the proposed schemes are also presented as well as hints for the selection of the most appropriate one, according to the multimedia author&#039;s requirements.  1. Introduction  A Multimedia Application (MAP) involves a variety of individual multimedia objects presented according to the MAP scenario. The multimedia objects that participate in the MAP, called actors, are transformed either spatially or temporally in order to be presented according to author&#039;s requirements. More...
KNOWEL A Hypermedia Knowledge Editor.

Event and Action Representation and Composition for Multimedia Application Scenario Modelling.
In this paper we present a model for the representation of multimedia applications based on the scenario concept. The scenario is described in terms of events and actions. The proposed model represents all the events that may occur in a multimedia application (originated from the system, the application or the user). As regards actions we propose a rich scheme for spatial an temporal composition representation based on operators that cover all the spatial and temporal relationships among multimedia objects. Finally the scenario of the application is represented as a set of scenario tuples that correspond to fundamental sets of actions originated by the same event (or events). 1. Introduction  Multimedia applications can be very complex as regards the number of involved objects, transformations of the objects in the scope of an application and relationships among them. We regard a multimedia application as a container that includes scenes (aggregations of objects in a thematic domain) w...
An Object%2DOriented Modeling of Multimedia Database Objects and Applications.

KNOWEL A Hypermedia Knowledge Editor.



Hypermedia and Knowledge Representation An Object%2DOriented Design Based on Fuzzy Logic.

An Object%2DOriented Model for Interactive Multimedia Presentations.

